#include<bits/stdc++.h>
using namespace std;
int n,a[100086],cnt=0;
deque<int> e;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+n+1);
    int re=a[1];
    e.push_front(a[1]);
    for(int i=2;i<=n;i++){
        if(!e.empty()&&a[i]>e.front())
            e.pop_front();
        e.push_back(a[i]);
    }
    cout<<e.size();
    return 0;
}
